On 4 - γt - Critical Graphs of Order 4 + Δ ( G )
نویسندگان
چکیده
A graph G with no isolated vertex is total domination vertex critical if for any vertex v of G that is not adjacent to a vertex of degree one, the total domination number of G− v is less than the total domination number of G. We call these graphs total domination critical or just γt-critical. If such a graph G has total domination number k, we call it k-γt-critical. We study an open problem of k-γt-critical graphs and obtain some results on the characterization of total domination critical graphs of order Δ(G) + 4. Mathematics Subject Classification: 05C69
منابع مشابه
A Note on Total Domination Critical Graphs
The total domination number of G denoted by γt(G) is the minimum cardinality of a total dominating set of G. A graph G is total domination vertex critical or just γt-critical, if for any vertex v of G that is not adjacent to a vertex of degree one, γt(G − v) < γt(G). If G is γt-critical and γt(G) = k, then G is k-γt-critical. Haynes et al [The diameter of total domination vertex critical graphs...
متن کاملTotal Domination in Partitioned Graphs
We present results on total domination in a partitioned graph G = (V,E). Let γt(G) denote the total dominating number of G. For a partition V1, V2, . . . , Vk, k ≥ 2, of V , let γt(G;Vi) be the cardinality of a smallest subset of V such that every vertex of Vi has a neighbour in it and define the following ft(G;V1, V2, . . . , Vk) = γt(G) + γt(G;V1) + γt(G;V2) + . . .+ γt(G;Vk) ft(G; k) = max{f...
متن کاملCritical graphs with respect to total domination and connected domination
A graph G is said to be k-γt-critical if the total domination number γt(G) = k and γt(G + uv) < k for every uv / ∈ E(G). A k-γc-critical graph G is a graph with the connected domination number γc(G) = k and γc(G + uv) < k for every uv / ∈ E(G). Further, a k-tvc graph is a graph with γt(G) = k and γt(G− v) < k for all v ∈ V (G), where v is not a support vertex (i.e. all neighbors of v have degre...
متن کاملOn a Family of 4-Critical Graphs with Diameter Three
Let γt(G) denote the total domination number of the graph G. G is said to be total domination edge critical, or simply γt-critical, if γt(G+ e) < γt(G) for each edge e ∈ E(G). In this paper we study a family H of 4-critical graphs with diameter three, in which every vertex is a diametrical vertex, and every diametrical pair dominates the graph. We also generalize the self-complementary graphs, ...
متن کاملDomination and total domination in cubic graphs of large girth
The domination number γ(G) and the total domination number γt(G) of a graph G without an isolated vertex are among the most well studied parameters in graph theory. While the inequality γt(G) ≤ 2γ(G) is an almost immediate consequence of the definition, the extremal graphs for this inequality are not well understood. Furthermore, even very strong additional assumptions do not allow to improve t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007